A Fast Derandomization Schemes and Its Applications
نویسنده
چکیده
We present a fast derandomization scheme for the PROFIT/COST problem. Through the applications of this scheme we show the time complexity of O(log 2 n loglog n) for the + 1 vertex coloring problem using O((m + n)= log logn) processors on the CREW PRAM, the time complexity of O(log 2:5 n) for the maximal independent set problem using O((m+n)= log 1:5 n) processors on the CREW PRAM and the time complexity of O(log 2:5 n) for the maximal matching problem using O((m+n)= log 0:5 n) processors on the EREW PRAM.
منابع مشابه
A survey on digital data hiding schemes: principals, algorithms, and applications
This paper investigates digital data hiding schemes. The concept of information hiding will be explained at first, and its traits, requirements, and applications will be described subsequently. In order to design a digital data hiding system, one should first become familiar with the concepts and criteria of information hiding. Having knowledge about the host signal, which may be audio, image, ...
متن کاملA Fast Publicly Verifiable Secret Sharing Scheme using Non-homogeneous Linear Recursions
A non-interactive (t,n)-publicly veriable secret sharing scheme (non-interactive (t,n)-PVSS scheme) is a (t,n)-secret sharing scheme in which anyone, not only the participants of the scheme, can verify the correctness of the produced shares without interacting with the dealer and participants. The (t,n)-PVSS schemes have found a lot of applications in cryptography because they are suitable for<...
متن کاملImproved Bounds for Quantified Derandomization of Constant-Depth Circuits and Polynomials
This work studies the question of quantified derandomization, which was introduced by Goldreich and Wigderson (STOC 2014). The generic quantified derandomization problem is the following: For a circuit class C and a parameter B = B(n), given a circuit C ∈ C with n input bits, decide whether C rejects all of its inputs, or accepts all but B(n) of its inputs. In the current work we consider three...
متن کاملApplications of Orthogonal Arrays to Computer Science
Orthogonal arrays (OAs) are basic combinatorial structures, originally studied by statisticians motivated by their applications to design of experiments. In recent years, they have found numerous applications in computer science. Among their applications are derandomization of algorithms, random pattern testing of VLSI chips, authentication codes, universal hash functions, threshold schemes, an...
متن کاملA Matrix Hyperbolic Cosine Algorithm and Applications
Wigderson and Xiao presented an efficient derandomization of the matrix Chernoff bound using the method of pessimistic estimators [WX08]. Building on their construction, we present a derandomization of the matrix Bernstein inequality which can be viewed as generalization of Spencer’s hyperbolic cosine algorithm [Spe77]. We apply our construction to several problems by analyzing its computationa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1991